/*Desert
A tourist gets lost in the desert with n liters of water. He drinks positive integer units of water each day.
Write a program to calculate how many different ways the tourist can drink up the water.
Input
The first line contains the number of test cases T(T≤10)T(T≤10).
Next TT lines contain the number n(1≤n≤1000000)n(1≤n≤1000000) for each test case.
Output
Output consists of TT lines.
Each line contains the binary number which represents number of different ways to finish up the water specified in the test case.

Sample Input
1
3
Sample Output
100

Hint
3 liters of water can be comsumed in four different ways show in the following.
1. 1 1 1
2. 1 2
3. 2 1
4. 3
If we write 4 in binary, it's 100.
*/
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
const int INF = 2 << 28;
const int maxn = 10001;
using namespace std;

int T, n;

int main()
{
    scanf("%d", &T);
    while (T --)
    {
        scanf("%d", &n);
        cout << 1;
        for (int i = 1;i < n;i ++)
            cout << 0;
        cout << endl;
    }
    return 0;
}
